An nlogn algorithm for hyper-minimizing a (minimized) deterministic automaton
نویسندگان
چکیده
We improve a recent result [Badr: Hyper-minimization inO(n). Int. J. Found. Comput. Sci. 20, 2009] for hyper-minimized nite automata. Namely, we present an O(n log n) algorithm that computes for a given deterministic nite automaton (dfa) an almostequivalent dfa that is as small as possible such an automaton is called hyper-minimal. Here two nite automata are almost-equivalent if and only if the symmetric di erence of their languages is nite. In other words, two almost-equivalent automata disagree on acceptance on nitely many inputs. In this way, we solve an open problem stated in [Badr, Geffert, Shipman: Hyper-minimizing minimized deterministic nite state automata. RAIRO Theor. Inf. Appl. 43, 2009] and by Badr. Moreover, we show that minimization linearly reduces to hyper-minimization, which shows that the time-bound O(n log n) is optimal for hyper-minimization. Independently, similar results were obtained in [Gawrychowski, Je»: Hyper-minimisation made e cient. Proc. MFCS, LNCS 5734, 2009].
منابع مشابه
An nlogn Algorithm for Hyper-minimizing States in a (Minimized) Deterministic Automaton
We improve a recent result [A. Badr: Hyper-Minimization in O(n). In Proc. CIAA, LNCS 5148, 2008] for hyper-minimized finite automata. Namely, we present an O(n logn) algorithm that computes for a given finite deterministic automaton (dfa) an almost equivalent dfa that is as small as possible—such an automaton is called hyper-minimal. Here two finite automata are almost equivalent if and only if...
متن کاملHyper-Minimizing States in a (Minimized) Deterministic Automaton
We improve a recent result [A. Badr: Hyper-Minimization in O(n). In Proc. CIAA, LNCS 5148, 2008] for hyper-minimized finite automata. Namely, we present an O(n log n) algorithm that computes for a given finite deterministic automaton (dfa) an almost equivalent dfa that is as small as possible—such an automaton is called hyper-minimal. Here two finite automata are almost equivalent if and only i...
متن کاملBetter Hyper-minimization - Not as Fast, But Fewer Errors
Hyper-minimization aims to compute a minimal deterministic finite automaton (dfa) that recognizes the same language as a given dfa up to a finite number of errors. Algorithms for hyper-minimization that run in time O(n logn), where n is the number of states of the given dfa, have been reported recently in [Gawrychowski and Jeż: Hyperminimisation made efficient. Proc. Mfcs, Lncs 5734, 2009] and ...
متن کاملMINIMIZATION OF DETERMINISTIC FINITE AUTOMATA WITH VAGUE (FINAL) STATES AND INTUITIONISTIC FUZZY (FINAL) STATES
In this paper, relations among the membership values of gener- alized fuzzy languages such as intuitionistic fuzzy language, interval-valued fuzzy language and vague language are studied. It will aid in studying the properties of one language when the properties of another are known. Further, existence of a minimized nite automaton with vague ( final) states for any vague regular language recog...
متن کاملOptimal Hyper-Minimization
Minimal deterministic finite automata (dfas) can be reduced further at the expense of a finite number of errors. Recently, such minimization algorithms have been improved to run in time O(n logn), where n is the number of states of the input dfa, by [Gawrychowski and Jeż: Hyper-minimisation made efficient. Proc. Mfcs, Lncs 5734, 2009] and [Holzer and Maletti: An n logn algorithm for hyper-minim...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Theor. Comput. Sci.
دوره 411 شماره
صفحات -
تاریخ انتشار 2010